Almost minimal orthogonal projections

نویسندگان

چکیده

The projection constant $\Pi(E):=\Pi(E, \ell_\infty)$ of a finite-dimensional Banach space $E\subset\ell_\infty$ is by definition the smallest norm linear $\ell_\infty$ onto $E$. Fix $n\geq 1$ and denote $\Pi_n$ maximal value $\Pi(\cdot)$ amongst $n$-dimensional real spaces. We prove for every $\varepsilon >0$ that there exist an integer $d\geq subspace $E\subset\ell_1^d$ such $\Pi_n \leq \Pi(E, \ell_1^d) +2 \varepsilon$ orthogonal $P\colon \ell_1^d\to E$ almost minimal in sense $\lVert P \rVert \ell_1^d)+\varepsilon$. As consequence our main result, we obtain formula relating to absolute row-sums matrices rank $n$.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Almost Orthogonal Submatrices of an Orthogonal Matrix

Let t ≥ 1 and let n, M be natural numbers, n < M. Let A = (a i,j) be an n × M matrix whose rows are orthonormal. Suppose that for all j M n · n i=1 a 2 i,j 1/2 ≤ t.

متن کامل

Products of Orthogonal Projections

We give a characterization of operators on a separable Hilbert space of norm less than one that can be represented as products of orthogonal projections and give an estimate on the number of factors. We also describe the norm closure of the set of all products of orthogonal projections.

متن کامل

Minimal Almost Convexity

In this article we show that the Baumslag-Solitar group BS(1, 2) is minimally almost convex, or MAC. We also show that BS(1, 2) does not satisfy Poénaru’s almost convexity condition P (2), and hence the condition P (2) is strictly stronger than MAC. Finally, we show that the groups BS(1, q) for q ≥ 7 and Stallings’ non-FP3 group do not satisfy MAC. As a consequence, the condition MAC is not a c...

متن کامل

On Minimal and Almost-Minimal Linear Codes

Minimal linear codes are such that the support of every codeword does not contain the support of another linearly independent codeword. Such codes have applications in cryptography, e.g. to secret sharing and secure two-party computations. We pursue here the study of minimal codes and construct infinite families with asymptotically non-zero rates. We also introduce a relaxation to almost minima...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Israel Journal of Mathematics

سال: 2021

ISSN: ['1565-8511', '0021-2172']

DOI: https://doi.org/10.1007/s11856-021-2163-8